Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up Evaluation

نویسندگان

  • Stefan Brass
  • Heike Stephan
چکیده

on (Constraint) Logic Programming and 24th International Workshop on Functional and (Constraint) Logic Programming (WLP’15/’16/WFLP’16). EPTCS 234, 2017, pp. 57–72, doi:10.4204/EPTCS.234.5 c © S. Brass & H. Stephan This work is licensed under the Creative Commons Attribution-Noncommercial-No Derivative Works License. Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up Evaluation

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation Alternatives for Bottom-Up Evaluation

Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDmagic that ensures that only facts relevant for the query can be derived. Then bottomup evaluation simply performs the iteration of the standard TP -operator to compute the minimal model. However, there are different ways to imp...

متن کامل

Modeling Uncertainty in Deductive Databases

Information Source Tracking (IST) method has been developed recently for the modeling and manipulation of uncertain and inaccurate data in relational databases. In this paper we extend the IST method to deductive databases. We show that positive uncertain databases, i.e. IST-based deductive databases with only positive literals in the heads and the bodies of the rules, enjoy a least model/least...

متن کامل

A Framework for an Efficient Implementation of Deductive Databases∗

We describe a method for query evaluation in deductive databases which is based on dynamic filtering of data flow. The basic query evaluation strategy is bottom-up and set-oriented. The method imposes no restrictions on the form of Horn axioms, takes advantage of actually stored data, allows compile time preprocessing, and is well suited for parallel and distributed execution.

متن کامل

Deductive and Object-Oriented Databases

It is desirable to answer queries posed to deductive databases by computing fix-points because such computations are directly amenable to set-oriented fact processing. However, the classical fixpoint procedures based on bottom-up reasoning-the naive and semi-naive methods-are rather primitive and often inefficient. In this article, we rely on bottom-up meta-interpretation for formalizing a new ...

متن کامل

Pseudo-Naive Evaluation

We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive evaluation and semi-naive evaluation. Pseudo-naive evaluation adds a data-driven component to naive evaluation without explicitly collecting the ‘delta’ sets of new facts derivable at each iteration. Instead, it identi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017